n, k = list(map(int, input().split()))
w = input().split()
d = 0
for i in range(n):
c = 0
for j in range(len(w[i])):
if w[i][j] == '4' or w[i][j] == '7':
c += 1
if c > k:
d += 1
print(n-d)#include<bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
for(int i = 0; i < n; i++) {
string s;
cin >> s;
int c = 0;
for(auto i:s) {
if(i=='4' or i=='7') {
c ++;
}
}
if(c<=k) {
ans ++;
}
}
cout << ans;
}765A - Neverending competitions | 1303A - Erasing Zeroes |
1005B - Delete from the Left | 94A - Restoring Password |
1529B - Sifid and Strange Subsequences | 1455C - Ping-pong |
1644C - Increase Subarray Sums | 1433A - Boring Apartments |
1428B - Belted Rooms | 519B - A and B and Compilation Errors |
1152B - Neko Performs Cat Furrier Transform | 1411A - In-game Chat |
119A - Epic Game | 703A - Mishka and Game |
1504C - Balance the Bits | 988A - Diverse Team |
1312B - Bogosort | 1616B - Mirror in the String |
1660C - Get an Even String | 489B - BerSU Ball |
977C - Less or Equal | 1505C - Fibonacci Words |
1660A - Vasya and Coins | 1660E - Matrix and Shifts |
1293B - JOE is on TV | 1584A - Mathematical Addition |
1660B - Vlad and Candies | 1472C - Long Jumps |
1293D - Aroma's Search | 918A - Eleven |